Longest read?

Read Your Published Papers

سخن سردبیر Editorial مجله دانشگاه علوم پزشکی رفسنجان دوره نوزدهم، دی 1399، 1014-1013       مقالات منتشر شده خودتان را بخوانید Read Your Published Papers     محسن رضائیان[1]   M. Rezaeian     تا کنون در مجله دانشگاه، پیرامون مطالعه مستمر یک مقاله قبل از چاپ آن توسط نویسندگان، نکات مهمی را به رشته تحریر در آورده‌ایم [3-1]. مطالعه‌ی چند باره یک مقاله، قبل از آن که مقاله منتشر گردد،...

“Read” and ‘Tailor’ Your Treatment

Introduction: Thesinonasal tract is an area that may be affected by various types of neoplastic lesions with more variety than what is encountered in other parts of the upper airway and food passage.   Case Report: An elderly gentleman of 65 years complained of nose block on both sides for 3 months. On examination, he had firm polypoidal masses arising from the middle me...

Longest Tokenization

Longest Biased Interval and Longest Non-negative Sum Interval

UNLABELLED Described is an algorithm to find the longest interval having at least a specified minimum bias in a sequence of characters (bases, amino acids), e.g. 'at least 0.95 (A+T)-rich'. It is based on an algorithm to find the longest interval having a non-negative sum in a sequence of positive and negative numbers. In practice, it runs in linear time; this can be guaranteed if the bias is r...

Intersecting longest paths and longest cycles: A survey

This is a survey of results obtained during the last 45 years regarding the intersection behaviour of all longest paths, or all longest cycles, in connected graphs. Planar graphs and graphs of higher connectivity receive special attention. Graphs embeddable in the cubic lattice of arbitrary dimension, and graphs embeddable in the triangular or hexagonal lattice of the plane are also discussed. ...